Surplus equivalence of leveled commitment contracts

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Surplus Equivalence of Leveled Commitment Contracts

In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding. Leveled commitment contracts — i.e., contracts where each party can decommit by paying a predetermined penalty — were recently shown to improve expected social welfare even if agents decommit strategically in Nash equilibrium. Such contracts differ based on whether agents have to de...

متن کامل

Revenue Equivalence of Leveled Commitment Contracts Revenue Equivalence of Leveled Commitment Contracts

In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding. Leveled commitment contracts | i.e. contracts where each party can decommit by paying a predetermined penalty|were recently shown to improve expected social welfare even if agents decommit insincerely in Nash equilibrium. Such contracts diier based on whether agents have to declare ...

متن کامل

Revenue Equivalence of Leveled Commitment Contracts

In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding. Leveled commitment contracts i.e. contracts where each party can decommit by paying a predetermined penalty were recently shown to improve expected social welfare even if agents decommit insincerely in Nash equilibrium. Such contracts differ based on whether agents have to declare t...

متن کامل

Algorithms for Optimizing Leveled Commitment Contracts Algorithms for Optimizing Leveled Commitment Contracts

In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding. Leveled commitment contracts | i.e. contracts where each party can decommit by paying a predetermined penalty | were recently shown to improve Pareto ef-ciency even if agents rationally decommit in Nash equilibrium using innated thresholds on how good their outside ooers must be bef...

متن کامل

Algorithms for Optimizing Leveled Commitment Contracts

In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding. Leveled commitment contracts i.e. contracts where each party can decommit by paying a predetermined penalty were recently shown to improve Pareto efficiency even if agents rationally decommit in Nash equilibrium using inflated thresholds on how good their outside offers must be befo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Artificial Intelligence

سال: 2002

ISSN: 0004-3702

DOI: 10.1016/s0004-3702(02)00275-8